منابع مشابه
Disjoint Essential Cycles
Graphs that have two disjoint noncontractible cycles in every possible embedding in surfaces are characterized. Similar characterization is given for the class of graphs whose orientable embeddings (embeddings in surfaces different from the projective plane, respectively) always have two disjoint noncontractible cycles. For graphs which admit embeddings in closed surfaces without having two dis...
متن کاملDisjoint Directed Cycles
It is shown that there exists a positive so that for any integer k, every directed graph with minimum outdegree at least k contains at least k vertex disjoint cycles. On the other hand, for every k there is a digraph with minimum outdegree k which does not contain two vertex or edge disjoint cycles of the same length.
متن کاملEdge Disjoint Hamilton Cycles
In the late 70s, it was shown by Komlós and Szemerédi ([7]) that for p = lnn+ln lnn+c n , the limit probability for G(n, p) to contain a Hamilton cycle equals the limit probability for G(n, p) to have minimum degree at least 2. A few years later, Ajtai, Komlós and Szemerédi ([1]) have shown a hitting time version of this in the G(n,m) model. Say a graph G has property H if it contains bδ(G)/2c ...
متن کاملDisjoint Even Cycles Packing
We generalize the well-known theorem of Corrádi and Hajnal which says that if a given graph G has at least 3k vertices and the minimum degree of G is at least 2k, then G contains k vertex-disjoint cycles. Our main result is the following; for any integer k, there is an absolute constant ck satisfying the following; let G be a graph with at least ck vertices such that the minimum degree of G is ...
متن کاملDisjoint Cycles and Chorded Cycles in Graphs
Very recently, Bialostocki et al. proposed the following conjecture. Let r, s be two nonnegative integers and let G = (V (G), E(G)) be a graph with |V (G)| ≥ 3r + 4s and minimum degree δ(G) ≥ 2r + 3s. Then G contains a collection of r cycles and s chorded cycles, all vertex-disjoint. We prove that this conjecture is true.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1996
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.0073